Equidistribution in All Dimensions of Worst-Case Point Sets for the TSP
نویسندگان
چکیده
Given a set S of n points in the unit square [0, 1], an optimal traveling salesman tour of S is a tour of S that is of minimum length. A worst-case point set for the Traveling Salesman Problem in the unit square is a point set S whose optimal traveling salesman tour achieves the maximum possible length among all point sets S ⊂ [0, 1], where |S| = n. An open problem is to determine the structure of S. We show that for any rectangular parallelepiped R contained in [0, 1], the number of points in S ∩R is asymptotic to n times the volume of R. Analogous results are proved for the minimum spanning tree, minimum-weight matching, and rectilinear Steiner minimum tree. These equidistribution theorems are the first results concerning the structure of worst-case point sets like S.
منابع مشابه
Equidistribution in All Dimensions of Worst-Case Point Sets for the Traveling Salesman Problem
Given a set S of n points in the unit square $[ 0,1 ]^d $, an optimal traveling salesman tour of S is a tour of S that is of minimum length. A worst-case point set for the traveling salesman problem in the unit square is a point set $S^{( n )} $ whose optimal traveling salesman tour achieves the maximum possible length among all point sets $S \subset [ 0,1 ]^d $, where $| S | = n$. An open prob...
متن کاملA CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملCompound inversive congruential pseudorandom numbers: an average-case analysis
The present paper deals with the compound (or generalized) inversive congruential method for generating uniform pseudorandom numbers, which has been introduced recently. Equidistribution and statistical independence properties of the generated sequences over parts of the period are studied based on the discrepancy of certain point sets. The main result is an upper bound for the average value of...
متن کاملETH Library Improved Approximations for TSP with Simple Precedence Constraints⋆
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides’ algorithm and Hoogeveen’s algorithm by relating the two underlying problems, i. e., the traveling salesman problem and the problem of finding a minimum-weight Hamiltonian path between two prespecified vertices. We show that the sets of metric ...
متن کاملImproved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides’ algorithm and Hoogeveen’s algorithm by relating the two underlying problems, i. e., the traveling salesman problem and the problem of finding a minimum-weight Hamiltonian path between two prespecified vertices. We show that the sets of metric ...
متن کامل